Edge electrostatics revisited

Cutting Edge: Paradigm Revisited: Antibody

QUICKSELECT Revisited

We give an overview of the running time analysis of the random divide-and-conquer algorithm FIND or QUICKSELECT. The results concern moments, distribution of FIND’s running time, the limiting distribution, a stochastic bound and the key: a stochastic fixed point equation.

Equality of bulk and edge Hall conductance revisited

The integral quantum Hall effect can be explained either as resulting from bulk or edge currents (or, as it occurs in real samples, as a combination of both). This leads to different definitions of Hall conductance, which agree under appropriate hypotheses, as shown by Schulz-Baldes et al. by means of K-theory. We propose an alternative proof based on a generalization of the index of a pair of ...

Edge Effects and Isolation: Red-Backed Voles Revisited

We examined demographic responses of California red-backed voles (Clethrionomys californicus) to forest fragmentation in southwestern Oregon at sites where this species has previously shown negative responses to fragmentation. Voles were captured in live traps and released. Voles were rarely caught in clearcuts surrounding 11 forest fragments, but relative vole density did not decrease from the...

Decomposing complete edge-chromatic graphs and hypergraphs. Revisited

A d-graph G = (V ;E1, . . . , Ed) is a complete graph whose edges are colored by d colors, or in other words, are partitioned into d subsets (some of which might be empty). We say that G is complementary connected if the complement to each chromatic component of G is connected on V , or in other words, if for each two vertices u,w ∈ V and color i ∈ I = {1, . . . , d} there is a path between u a...